Distortion Bounds for Source Broadcast Problem

نویسندگان

  • Lei Yu
  • Houqiang Li
  • Weiping Li
چکیده

This paper investigates the joint source-channel coding problem of sending a memoryless source over a memoryless broadcast channel. An inner bound and several outer bounds on the achievable distortion region are derived, which respectively generalize and unify several existing bounds. As a consequence, we also obtain an inner bound and an outer bound for degraded broadcast channel case. When specialized to Gaussian source broadcast or binary source broadcast, the inner bound and outer bound not only recover the best known inner bound and outer bound in the literature, but also are used to generate some new results. Besides, we also extend the inner bound and outer bounds to Wyner-Ziv source broadcast problem, i.e., source broadcast with side information available at decoders. Some new bounds are obtained when specialized to Wyner-Ziv Gaussian case and Wyner-Ziv binary case. In addition, when specialized to lossless transmission of a source with independent components, the bounds for source broadcast problem (without side information) are also used to achieve an inner bound and an outer bound on capacity region of general broadcast channel with common messages, which respectively generalize Marton’s inner bound and Nair-El Gamal outer bound to K-user broadcast channel case.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On the Energy-Distortion Tradeoff of Gaussian Broadcast Channels with Feedback

This work studies the relationship between the energy allocated for transmitting a pair of correlated Gaussian sources over a two-user Gaussian broadcast channel with noiseless channel output feedback (GBCF) and the resulting distortion at the receivers. Our goal is to characterize the minimum transmission energy required for broadcasting a pair of source samples, such that each source can be r...

متن کامل

Multiple description vector quantization with a coarse lattice

781 also be decoded by the better receiver. Once both receivers have removed the digital component from the received signal, the problem becomes that of transmitting a Gaussian source over a Gaussian broadcast channel. For this problem, analog transmission is optimal. III. CONCLUSION The distortion region for joint source–channel coding over the broadcast channel is yet unknown. Here we derived...

متن کامل

Broadcast Routing in Wireless Ad-Hoc Networks: A Particle Swarm optimization Approach

While routing in multi-hop packet radio networks (static Ad-hoc wireless networks), it is crucial to minimize power consumption since nodes are powered by batteries of limited capacity and it is expensive to recharge the device. This paper studies the problem of broadcast routing in radio networks. Given a network with an identified source node, any broadcast routing is considered as a directed...

متن کامل

Robust Distributed Source Coding with Arbitrary Number of Encoders and Practical Code Design Technique

The robustness property can be added to DSC system at the expense of reducing performance, i.e., increasing the sum-rate. The aim of designing robust DSC schemes is to trade off between system robustness and compression efficiency. In this paper, after deriving an inner bound on the rate–distortion region for the quadratic Gaussian MDC based RDSC system with two encoders, the structure of...

متن کامل

Approximate Characterizations for the Gaussian Source Broadcast Distortion Region

We consider the joint source-channel coding problem of sending a Gaussian source over a K-user Gaussian broadcast channel with bandwidth mismatch. A new outer bound to the achievable distortion region is derived using the technique of introducing more than one additional auxiliary random variable, which was previously used to derive sum-rate lower bound for the symmetric Gaussian multiple descr...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2016